Explaining ALC Subsumption
نویسندگان
چکیده
Knowledge representation systems, including ones based on Description Logics (DLs), use explanation facilities to, among others, debug knowledge bases. Until now, such facilities were not available for expressive DLs, whose reasoning is an un-natural refutation-based tableau. We offer a solution based on a sequent calculus that is closely related to the tableau implementation, exploiting its optimisations. The resulting proofs are pruned and then presented as simply as possible using templates.
منابع مشابه
Explaining Subsumption by Optimal Interpolation
We describe ongoing research to support the construction of terminologies with Description Logics. For the explanation of subsumption we search for particular concepts because of their syntactic and semantic properties. More precisely, the set of explanations for a subsumption P N is the set of optimal interpolants for P and N . We provide definitions for optimal interpolation and an algorithm ...
متن کاملA Description Logic for Vague KnowledgeC
This work introduces the concept language ALC F M which is an extension of ALC to many-valued logics. ALC F M allows to express vague concepts, e.g. more or less enlarged or very small. To realize this extension to many-valued logics, the classical notions of satissability and subsumption had to be modiied appropriately. For example, ALC F M-concepts are no longer either satissable or unsatissa...
متن کاملGeneralized Complexity of ALC Subsumption
The subsumption problem with respect to terminologies in the description logic ALC is EXP-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of the notion of clones in the context of Post’s lattice. Furthermore we consider all four possible quantifier combinations for each fragment parameterized by a clone...
متن کاملPrime Implicate Normal Form for ALC Concepts
In this paper, we present a new normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate. We show that concepts in prime implicate normal form enjoy a number of desirable properties which make prime implicate normal form interesting from the viewpoint of knowledge compilation. In particular, we prove that subsumption betw...
متن کاملKIT REPORT 91 A Correspondence Theory for Terminological Logics: Preliminary Report
We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K(m). To demonstrate the utility of the correspondence, we give two of its immediate by-products. Namely, we axiomatize ALC and give a simple proof that subsumption in ALC is PSPACE-complete, replacing the original six-page one. Furt...
متن کامل